A Lazy SMT-Solver for a Non-Linear Subset of Real Algebra
نویسندگان
چکیده
There are several methods for the synthesis and analysis of hybrid systems that require efficient algorithms and tool for satisfiability checking. In this paper we give examples of such synthesis and analysis methods, and discuss decision procedures that can be used for this purpose.
منابع مشابه
A Modular Approach to MaxSAT Modulo Theories
In this paper we present a novel “modular” approach for (weighted partial) MaxSAT Modulo Theories. The main idea is to combine a lazy SMT solver with a purely-propositional (weighted partial) MaxSAT solver, by making them exchange information iteratively: the former produces an increasing set of theory lemmas which are used by the latter to progressively refine an approximation of the final sub...
متن کاملA Practical Approach to Satisability Modulo Linear Integer Arithmetic
We present a detailed description of a theory solver for Linear Integer Arithmetic (LA(Z)) in a lazy SMT context. Rather than focusing on a single technique that guarantees theoretical completeness, the solver makes extensive use of layering and heuristics for combining different techniques in order to achieve good performance in practice. The viability of our approach is demonstrated by an emp...
متن کاملI-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra
This paper connects research in computer science in the field of SAT-modulo-theories (SMT) solving and research in mathematics on decision procedures for real algebra. We consider a real algebraic decision procedure computing all realizable sign conditions of a set of polynomials. We modify this procedure so that it satisfies certain requirements needed for the embedding into an SMT-solver.
متن کاملLazy Satisfiability Modulo Theories
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T )). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in f...
متن کاملLazy Satisability Modulo Theories
Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T )). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010